Hop Differentiating Hop Dominating Sets in Graphs
نویسندگان
چکیده
A subset S of V (G), where G is a simple undirected graph, hop dominating if for each v ∈ (G) \ S, there exists w such that dG(v, w) = 2 and it differentiating N2 G[u] ∩ ̸= G[v] any two distinct vertices u, (G). set ⊆ both in G. The minimum cardinality G, denoted by γdh(G), called the domination number In this paper, we investigate some properties newly defined parameter. particular, characterize sets graphs under binary operations.
منابع مشابه
Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets
This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable “shortest path property”. Routing via the backbone created is also discussed. The algorithm has a “constant-time” comp...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملHop Domination in Graphs-II
Let G = (V,E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V − S, there exists u ∈ S such that d(u, v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G). In this paper we characterize the family of trees and unicyclic graphs for which γh(G) = γt(G) and γh(G) = γc(G) where γt(G) and γc(G) are the ...
متن کاملImproving route discovery in on-demand routing protocols using two-hop connected dominating sets
Many signaling or data forwarding operations involve the broadcasting of packets, which incurs considerable collisions in ad hoc networks based on a contention-based channel access protocol. We propose the Threehop Horizon Pruning (THP) algorithm to compute two-hop connected dominating set (TCDS) using only local topology information (i.e., two-hop neighborhood). Because every node has the two-...
متن کاملEnergy-Efficient and Connected D-Hop Dominating Sets in Wireless Sensor Networks
With a small battery equiped in each sensor, a large number of sensor are deployed in a specified area for many different application. Each sensor will perform two simple tasks of collecting (sensing) the surrounding inviroment and delivering the information to the central. While the equiped battery is irreplaceable, many researches concentrate on the extending the networks formed by these sens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2023
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v16i1.4673